Inverse Power Flow Problem

نویسندگان

چکیده

This paper formulates the inverse power flow problem which is to infer nodal admittance matrix (hence network structure of system) from voltage and current phasors measured at a number buses. We show that can be uniquely identified sequence measurements corresponding different steady states when every node in system equipped with measurement device, Kron-reduced determined even if some nodes are not monitored (hidden nodes). Furthermore, we propose effective algorithms based on graph theory uncover actual radial systems hidden nodes. provide theoretical guarantees for recovered demonstrate fully under mild assumptions. Simulations standard test confirm these capable providing accurate estimates noisy sensor data.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the inverse power index problem

Weighted voting games are frequently used in decision making. Each voter has a weight and a proposal is accepted if the weight sum of the supporting voters exceeds a quota. One line of research is the efficient computation of so-called power indices measuring the influence of a voter. We treat the inverse problem: Given an influence vector and a power index, determine a weighted voting game suc...

متن کامل

Inverse scheduling: two-machine flow-shop problem

We study an inverse counterpart of the two machine flow-shop scheduling problem that arises in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find job sequence(s) for which the value of the makespan is minimum, in the inverse scheduling the exact values of processing times are unknown and they should be selected with...

متن کامل

Capacity inverse minimum cost flow problem

Given a directed graph G = (N,A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacity vector û for the arc set A such that a given feasible flow x̂ is optimal with respect to the modified capacities. Among all capacity vectors û satisfying this condition, we would like to find one with minimum ‖û− u‖ value....

متن کامل

Inverse feasible problem

In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Control of Network Systems

سال: 2023

ISSN: ['2325-5870', '2372-2533']

DOI: https://doi.org/10.1109/tcns.2022.3199084